package com.lxq.LeetCode.uniquePaths;

public class Solution {
    public static void main(String[] args) {
        System.out.println(uniquePaths(3,3));
    }

    public static int uniquePaths(int m, int n) {
        if (m == 1 || n == 1) {
            return 1;
        }
        int[][] dynamicTable = new int[m][n];
        for (int i = 0; i < n; i++) {
            dynamicTable[0][i] = 1;
        }
        for (int i = 1; i < m; i++) {
            dynamicTable[i][0] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dynamicTable[i][j] = dynamicTable[i - 1][j] + dynamicTable[i][j - 1];

            }
        }
        return dynamicTable[m - 1][n - 1];
    }
}
